#define _CRT_SECURE_NO_WARNINGS

//https://leetcode.cn/problems/maximum-depth-of-binary-tree/submissions/
int maxDepth(struct TreeNode* root) {
    if (root == NULL)
        return 0;


    int LeftTree = maxDepth(root->left);
    int RightTree = maxDepth(root->right);

    return LeftTree > RightTree ? LeftTree + 1 : RightTree + 1;
}